Trajectory Generation by Chance-Constrained Nonlinear MPC With Probabilistic Prediction

نویسندگان

چکیده

Continued great efforts have been dedicated toward high-quality trajectory generation based on optimization methods; however, most of them do not suitably and effectively consider the situation with moving obstacles; more particularly, future position these obstacles in presence uncertainty within some possible prescribed prediction horizon. To cater to this rather major shortcoming, work shows how a variational Bayesian Gaussian mixture model (vBGMM) framework can be employed predict then methodology, is proposed which will efficiently address obstacles, incorporate In work, full predictive conditional probability density function (PDF) mean covariance obtained and, thus, formulated as collision region represented by confidence ellipsoid. avoid region, chance constraints are imposed restrict probability, subsequently, nonlinear control problem constructed constraints. It shown that approach able effectively; environmental information probabilistic prediction, it also timing avoidance earlier than method without prediction. The tracking error distance smaller compared

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chance-Constrained Probabilistic Simple Temporal Problems

Scheduling under uncertainty is essential to many autonomous systems and logistics tasks. Probabilistic methods for solving temporal problems exist which quantify and attempt to minimize the probability of schedule failure. These methods are overly conservative, resulting in a loss in schedule utility. Chance constrained formalism address over-conservatism by imposing bounds on risk, while maxi...

متن کامل

DTN Routing with Probabilistic Trajectory Prediction

Many real-world DTN application involve vehicles that do not have a purely random mobility pattern. In most cases nodes follow a predefined trajectory in space that may deviate from the norm due to environment factors or random events. In this paper we propose a DTN routing scheme for applications where the node trajectory and the contact schedule can be predicted probabilistically. We describe...

متن کامل

Chance-Constrained Programs for Link Prediction

In this paper, we consider the link prediction problem, where we are given a partial snapshot of a network at some time and the goal is to predict additional links at a later time. The accuracy of the current prediction methods is quite low due to the extreme class skew and the large number of potential links. In this paper, we describe learning algorithms based on chance constrained programs a...

متن کامل

Resolving Over-Constrained Probabilistic Temporal Problems through Chance Constraint Relaxation

When scheduling tasks for field-deployable systems, our solutions must be robust to the uncertainty inherent in the real world. Although human intuition is trusted to balance reward and risk, humans perform poorly in risk assessment at the scale and complexity of real world problems. In this paper, we present a decision aid system that helps human operators diagnose the source of risk and manag...

متن کامل

Chance Constrained RRT for Probabilistic Robustness to Environmental Uncertainty

Citation Luders, Brandon J., Mangal Kothariyand and Jonathan P. How. "Chance Constrained RRT for Probabilistic Robustness to Environmental Uncertainty." In Proceedings of the AIAA Guidance, Navigation, and Control Conference, Toronto, Ontario, Canada, 2-5 August 2010. As Published http://aiaa-mgnc10.abstractcentral.com/societyimages/aiaamgnc10/TorontoConfs2010_IP.pdf Publisher American Institut...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE transactions on cybernetics

سال: 2021

ISSN: ['2168-2275', '2168-2267']

DOI: https://doi.org/10.1109/tcyb.2020.3032711